Перевод: с английского на русский

с русского на английский

value-iteration method

См. также в других словарях:

  • Iteration — means the act of repeating.MathematicsIteration in mathematics may refer to the process of iterating a function, or to the techniques used in iterative methods for solving numerical problems.ComputingIteration in computing is the repetition of a… …   Wikipedia

  • Value at risk — (VaR) is a maximum tolerable loss that could occur with a given probability within a given period of time. VaR is a widely applied concept to measure and manage many types of risk, although it is most commonly used to measure and manage the… …   Wikipedia

  • Power iteration — In mathematics, the power iteration is an eigenvalue algorithm: given a matrix A , the algorithm will produce a number lambda; (the eigenvalue) and a nonzero vector v (the eigenvector), such that Av = lambda; v .The power iteration is a very… …   Wikipedia

  • Brent's method — In numerical analysis, Brent s method is a complicated but popular root finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation. It has the reliability of bisection but it can be as quick as some of …   Wikipedia

  • Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… …   Wikipedia

  • Graeffe's method — In mathematics, Graeffe s method or Dandelin–Graeffe method is an algorithm for finding all of the roots of a polynomial. It was developed independently by Germinal Pierre Dandelin in 1826 and Karl Heinrich Gräffe in 1837. Lobachevsky in 1834… …   Wikipedia

  • Fixed point iteration — In numerical analysis, fixed point iteration is a method of computing fixed points of iterated functions.More specifically, given a function f defined on the real numbers with real values and given a point x 0 in the domain of f, the fixed point… …   Wikipedia

  • Durand–Kerner method — In numerical analysis, the Durand–Kerner method established 1960–66 and named after E. Durand and Immo Kerner, also called the method of Weierstrass, established 1859–91 and named after Karl Weierstrass, is a root finding algorithm for… …   Wikipedia

  • Durand-Kerner method — In numerical analysis, the Durand ndash;Kerner method (established 1960 ndash;66) or method of Weierstrass (established 1859 ndash;91) is a root finding algorithm for solving polynomial equations. In other words, the method can be used to solve… …   Wikipedia

  • Chakravala method — The chakravala method (Hindi: चक्रवाल विधि) is a cyclic algorithm to solve indeterminate quadratic equations, including Pell s equation. It is commonly attributed to Bhāskara II, (c. 1114 – 1185 CE)[1][2] although some attribute it to Jayadeva (c …   Wikipedia

  • Gauss–Seidel method — The Gauss–Seidel method is a technique used to solve a linear system of equations. The method is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel. The method is an improved version of the Jacobi method. It… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»